a cca2-secure incomparable public key encryption scheme
نویسندگان
چکیده
in 2003, waters, felten and sahai introduced a novel cryptographic primitive called incomparable public key cryptosystem to protect anonymity of message receivers in an untrusted network. in this setting, a receiver is allowed to create many anonymous identities for himself without divulging the fact that all these identities refer to the same receiver. recently, lee and lim improved the solution of waters et al. with a more efficient decryption process. both of these schemes are based on the elgamal encryption scheme and are cca1-secure in the sense of data privacy and ik-cpa-secure in the sense of key privacy. in this paper, we employ the cramer-shoup encryption scheme to propose the first example of an incomparable public key encryption scheme which is cca2-secure in data privacy and ik-cca-secure in key privacy. therefore, our scheme outperforms existing incomparable public key schemes in security properties.
منابع مشابه
A General Construction of IND-CCA2 Secure Public Key Encryption
We propose a general construction for public key encryption schemes that are IND-CCA2 secure in the random oracle model. We show that the scheme proposed in 1, 2] ts our general framework and moreover that our method of analysis leads to a more eecient security reduction.
متن کاملA CCA2 Secure Public Key Encryption Scheme Based on the McEliece Assumptions in the Standard Model
We show that a recently proposed construction by Rosen and Segev can be used for obtaining the first public key encryption scheme based on the McEliece assumptions which is secure against adaptive chosen ciphertext attacks in the standard model.
متن کاملBounded CCA2-Secure Encryption
Whereas encryption schemes withstanding passive chosenplaintext attacks (CPA) can be constructed based on a variety of computational assumptions, only a few assumptions are known to imply the existence of encryption schemes withstanding adaptive chosen-ciphertext attacks (CCA2). Towards addressing this asymmetry, we consider a weakening of the CCA2 model — bounded CCA2-security — wherein securi...
متن کاملA CCA2-Secure Multi-Decrypter Encryption Scheme Without Random Oracles
Shengbao WANG, Peng ZENG, Kim-Kwang Raymond CHOO, Hongbing WANG 1School of Information Science and Engineering, Hangzhou Normal University Hangzhou 310012, PR China 2Shanghai Key Laboratory of Trustworthy Computing, East China Normal University Shanghai 200062, PR China 3Information Assurance Research Group, Advanced Computing Research Centre University of South Australia, Adelaide SA 5000, Aus...
متن کاملA More Secure MFE Multivariate Public Key Encryption Scheme
In 2007 PKC conference, Ding, et al use the second order linearization equation attack method to break what be called MFE multivariate public key encryption scheme, and also proposed a high order linearization equation attack on multivariate public key cryptosystems. To resist high order linearization equation attack, we present an enhanced MFE encryption scheme in this article. The improved sc...
متن کاملSecure Random Linear Code Based Public Key Encryption Scheme RLCE
As potential post-quantum cryptographic schemes, lattice based encryption schemes and linear codes based encryption schemes have received extensive attention in recent years. Though LLL reduction algorithm has been one of the major cryptanalysis techniques for lattice based cryptographic systems, cryptanalysis techniques for linear codes based cryptographic systems are generally scheme specific...
متن کاملمنابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
journal of computing and securityجلد ۳، شماره ۱، صفحات ۰-۰
میزبانی شده توسط پلتفرم ابری doprax.com
copyright © 2015-2023